Universal algorithm

for a given class of algorithms

An algorithm depending on an input parameter $p$ which for different admissible values of $p$ models the work of any algorithm of a given class. Different formalizations of computability correspond to different refinements of the notion of a universal algorithm: for recursive functions (cf. Recursive function) it is the universal partial recursive function (cf. Universal function), for Turing machines it is the universal Turing machine, for normal algorithms it is the universal normal algorithm, etc.

References

[1]	V.A. Uspenskii, "Leçons sur les fonctions calculables" , Hermann (1966) (Translated from Russian)
[2]	A.I. Mal'tsev, "Algorithms and recursive functions" , Wolters-Noordhoff (1970) (Translated from Russian)
[3]	H. Rogers jr., "Theory of recursive functions and effective computability" , McGraw-Hill (1967) pp. 164–165